Decision Procedures for CTL*
نویسندگان
چکیده
We give an overview over three serious attempts to devise an effective decision method for CTL∗, namely Emerson and Jutla’s automata-theoretic decision procedure, Reynolds’ tableau search method and our recent approach based on an infinite tableau system with natural rules and with global conditions on the branches.
منابع مشابه
A Faster Tableau for CTL
There have been several recent suggestions for tableau systems for deciding satisfiability in the practically important branching time temporal logic known as CTL*. In this paper we present a streamlined and more traditional tableau approach built upon the author’s earlier theoretical work. Soundness and completeness results are proved. A prototype implementation demonstrates the significantly ...
متن کاملA Decision Procedure for CTL* Based on Tableaux and Automata
We present a decision procedure for the full branching-time logic CTL∗ which is based on tableaux with global conditions on infinite branches. These conditions can be checked using automata-theoretic machinery. The decision procedure then consists of a doubly exponential reduction to the problem of solving a parity game. This has advantages over existing decision procedures for CTL∗, in particu...
متن کاملEfficient Decision Procedures for Model Checking of Linear Time Logic Properties
We propose an algorithm for LTL model checking based on the classification of the automata and on guided symbolic search. Like most current methods for LTL model checking, our algorithm starts with a tableau construction and uses a model checker for CTL with fairness constraints to prove the existence of fair paths. However, we classify the tableaux according to their structure, and use efficie...
متن کاملOne-Pass Tableaux for Computation Tree Logic
We extend Schwendimann’s single-pass decision procedure for propositional linear temporal logic (PLTL) to give a single-pass tableau decision procedure for computational tree logic (CTL). The extension is non-trivial because the soundness proof requires a careful analysis of the interactions between the branching inherent in CTL-models, which is missing in PLTL-models, with the “or” branching i...
متن کاملGenerating Finite-State Abstractions of Reactive Systems Using Decision Procedures
We present an algorithm that uses decision procedures to generate finite-state abstractions of possibly infinite-state systems. The algorithm compositionally abstracts the transitions of the system, relative to a given, fixed set of assertions. Thus, the number of validity checks is proportional to the size of the system description, rather than the size of the abstract state-space. The generat...
متن کامل